Shortest Path Problems with Resource Constraints
نویسندگان
چکیده
In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This paper proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution methods. First and foremost, it provides a comprehensive survey on the subject.
منابع مشابه
Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملUnified Label-Setting Algorithm for variants of the Shortest Path Problem with Resource Constraints
The Shortest Path Problem with Resource Constraints is a common subproblem in many Branch-Cut-and-Price algorithms (BCP), e.g., routing and scheduling problems. This paper presents a general label-setting algorithm for solving various shortest path problems. An integration of the ‘Shortest Path Problem with Resource Constraints and k-cycle elimination’ with the ‘Partial Elementarity’ is introdu...
متن کاملChapter 2 SHORTEST PATH PROBLEMS WITH RESOURCE CONSTRAINTS
In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This chapter proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution meth...
متن کاملAn exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
In this paper, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a number of solution procedures based on column generation for several important problems, such as vehicle routing and crew-pairing. In many cases relaxing the restr...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کامل